Queue-Size Distribution in a Discrete-Time Finite-Capacity Model with a Single Vacation Mechanism

نویسندگان

چکیده

In the paper a finite-capacity discrete-time queueing system with geometric interarrival times and generally distributed processing is studied. Every time when service station becomes idle it goes for vacation of random duration that can be treated as power-saving mechanism. Application single policy one way to achieve symmetry in terms operating costs. A differential equations transient conditional queue-size distribution established. The solution corresponding written double probability generating functions found using analytical method based on linear algebraic approach. Moreover, representation probability-generating function stationary obtained. Numerical study illustrating theoretical results attached well.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Finite Capacity Priority Queue with Discouragement

In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...

متن کامل

ANALYSIS OF A DISCRETE-TIME IMPATIENT CUSTOMER QUEUE WITH BERNOULLI-SCHEDULE VACATION INTERRUPTION

This paper investigates a discrete-time impatient customer queue with Bernoulli-schedule vacation interruption. The  vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. We obtain the steady-state probabilities at arbitrary and outside observer's observation epochs using recursive technique. Cost analysi...

متن کامل

A Finite Capacity Bulk Service Queue with Single Vacation and Markovian Arrival Process

Vacation time queues with Markovian arrival process (MAP) are mainly useful in modeling and performance analysis of telecommunication networks based on asynchronous transfer mode (ATM) environment. This paper analyzes a single-server finite capacity queue wherein service is performed in batches of maximum size “b” with a minimum threshold “a” and arrivals are governed by MAP. The server takes a...

متن کامل

Analysis of a Single Server Queue with Working Vacation and Vacation Interruption

In this paper, an M/M/1 queue with working vacation and vacation interruption is investigated. The server is supposed to take a working vacation whenever the system becomes empty and if there are at least N customers waiting in the system at a service completion instant, vacation interruption happens and the server resumes a normal working period. A matrix geometric approach is employed to obta...

متن کامل

On transient queue-size distribution in the batch-arrivals system with a single vacation policy

A queueing system with batch Poisson arrivals and single vacations with the exhaustive service discipline is investigated. As the main result the representation for the Laplace transform of the transient queue-size distribution in the system which is empty before the opening is obtained. The approach consists of few stages. Firstly, some results for a “usual” system without vacations correspond...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2022

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym14112350